Application of DAC Codeword Spectrum: Expansion Factor

نویسنده

  • Yong Fang
چکیده

Distributed Arithmetic Coding (DAC) proves to be an effective implementation of Slepian-Wolf Coding (SWC), especially for short data blocks. To study the property of DAC codewords, the author has proposed the concept of DAC codeword spectrum1. For equiprobable binary sources, the problem was formatted as solving a system of functional equations. Then, to calculate DAC codeword spectrum in general cases, three approximation methods have been proposed. In this paper, the author makes use of DAC codeword spectrum as a tool to answer an important question: how many (including proper and wrong) paths will be created during the DAC decoding, if no path is pruned? The author introduces the concept of another kind of DAC codeword spectrum, i.e. time spectrum, while the originally-proposed DAC codeword spectrum is called path spectrum from now on. To measure how fast the number of decoding paths increases, the author introduces the concept of expansion factor which is defined as the ratio of path numbers between two consecutive decoding stages. The author reveals the relation between expansion factor and path/time spectrum, and proves that the number of decoding paths of any DAC codeword increases exponentially as the decoding proceeds. Specifically, when symbols ‘0’ and ‘1’ are mapped onto intervals [0, q) and [1− q, 1), where 0.5 < q < 1, the author proves that expansion factor converges to 2q as the decoding proceeds. Index Terms Distributed Source Coding (DSC), Slepian-Wolf Coding (SWC), Distributed Arithmetic Coding (DAC), Codeword Spectrum. This research was supported by National Science Foundation of China (NSFC) (grant nos. 61001100, 61077009, and 60975007) and Provincial Science Foundation of Shaanxi, China (grant no. 2010K06-15). The author is with the College of Information Engineering, Northwest A&F University, Shaanxi Yangling 712100, China (email: [email protected]; homepage: http://www.wavesharp.com/fangyong/). In the previous papers on this topic, the author uses the terminology “codeword distribution.” To avoid such an ugly statement “distribution of distributed ...,” the author will use “codeword spectrum” to replace “codeword distribution” from now on. October 18, 2010 DRAFT IEEE TRANSACTIONS ON INFORMATION THEORY (SUBMISSION) 2

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximation of DAC Codeword Distribution for Equiprobable Binary Sources along Proper Decoding Paths

Distributed Arithmetic Coding (DAC) is an effective implementation of Slepian-Wolf coding, especially for short data blocks. To research its properties, the concept of DAC codeword distribution along proper and wrong decoding paths has been introduced. For DAC codeword distribution of equiprobable binary sources along proper decoding paths, the problem was formatted as solving a system of funct...

متن کامل

A Matching Lower Bound on the Minimum Weight of SHA-1 Expansion Code

Recently, Wang, Yin, and Yu ([WYY05b]) have used a low weight codeword in the SHA-1 message expansion to show a better than brute force method to find collisions in SHA-1. The smallest minimum weight codeword they report has a (bit) weight of 25 in the last 60 of the 80 expanded words. In this paper we show, using a computer assisted method, that this is indeed the smallest weight codeword. In ...

متن کامل

HIGH RESOLUTION LASER SPECTROSCOPY IN COLD SUPERSONIC MOLECULAR BEAMS COOLING, REDUCTION OF DOPPLER WIDTH AND APPLICATION

The cooling of molecules during the adiabatic expansion of supersonic seeded molecular beams is reviewed and illustrated by the example of NO -molecules. The reduction of the Doppler width by collimation of the beam and the cooling to low rotational temperatures brings a significant simplification of the complex NO -absorption spectrum and allows its assignment. The measured rotational tem...

متن کامل

A Novel Interpolation Scheme and Apparatus to Extend DAC Usable Spectrum over Nyquist Frequency

A novel interpolation scheme to extend usable spectrum and upconvert in high performance D/A converters is addressed in this paper. By adjusting the pulse width of cycle and the production circuit of code, the expansion code is a null code or complementary code that is interpolation process. What the times and codes of interpolation decide DAC works in one of a normal mode or multi-mixer mode s...

متن کامل

Looping linear programming decoding of LDPC codes

Considering the Linear Programming (LP) decoding of Low-Density-Parity-Check (LDPC) code [1], we describe an efficient algorithm for finding pseudo codewords with the smallest effective distance. The algorithm, coined LP-loop, starts from choosing randomly initial configuration of the noise. The configuration is modified through a discrete number of steps. Each step consists of two sub-steps. F...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1010.3150  شماره 

صفحات  -

تاریخ انتشار 2010